Genetic manipulation: Relaxed rules provoke anger

Relaxed Genetic Programming

A study on the performance of solutions generated by Genetic Programming (GP) when the training set is relaxed (in order to allow for a wider definition of the desired solution) is presented. This performance is assessed through 2 important features of a solution: its generalization error and its bloat, a common problem of GP individuals. Some encouraging results are presented: we show how even...

Relaxed Observance of Traditional Marriage Rules Allows Social Connectivity without Loss of Genetic Diversity

Marriage rules, the community prescriptions that dictate who an individual can or cannot marry, are extremely diverse and universally present in traditional societies. A major focus of research in the early decades of modern anthropology, marriage rules impose social and economic forces that help structure societies and forge connections between them. However, in those early anthropological stu...

Optimal manipulation of voting rules

Complexity of voting manipulation is a prominent research topic in computational social choice. The voting manipulation literature usually assumes that the manipulator is only concerned with improving the outcome of the election from her perspective. However, in practice, the manipulator may also be reluctant to lie, i.e., she may have a preference for submitting a vote that does not deviate to...

Endophytic Fungi, Characteristics and Their Potential for Genetic Manipulation

Designing Flexible Negotiation Agent with Relaxed Decision Rules

This article presents a model for designing negotiation agent with two distinguishing features: 1) a marketdriven strategy and 2) a set of relaxed decision rules. Market-driven agents make adjustable rates of concession by reacting to changing market situations. In determining the amount of concession for each negotiation round, a market-driven agent is guided by three mathematical functions of...